Symbolic Analysis of Hybrid Systems
نویسندگان
چکیده
A hybrid system is a dynamical system whose behavior exhibits both discrete and continuous change. A hybrid automaton is a mathematical model for hybrid systems, which combines, in a single formalism, automaton transitions for capturing discrete change with di erential equations for capturing continuous change. In this survey, we demonstrate symbolic algorithms for the veri cation and controller synthesis of linear hybrid automata, a subclass of hybrid automata that can be analyzed automatically.
منابع مشابه
Neuro-ACT Cognitive Architecture Applications in Modeling Driver’s Steering Behavior in Turns
Cognitive Architectures (CAs) are the core of artificial cognitive systems. A CA is supposed to specify the human brain at a level of abstraction suitable for explaining how it achieves the functions of the mind. Over the years a number of distinct CAs have been proposed by different authors and their limitations and potentials were investigated. These CAs are usually classified as symbolic and...
متن کاملCompositional Termination Analysis of Symbolic Forward Analysis
Existing model checking tools for infinite state systems, such as UPPAAL, HYTECH and KRONOS, use symbolic forward analysis, a possibly nonterminating procedure. We give termination criteria that allow us to reason compositionally about systems defined with asynchronous parallel composition; we can prove the termination of symbolic forward analysis for a composed system from the syntactic condit...
متن کاملA symbolic simulator for hybrid equations
In this paper, the symbolic simulation of hybrid dynamical systems is studied and an algorithm to compute symbolic solutions for such systems is presented. The tasks to perform such simulations are introduced and an algorithm to symbolically calculate a solution to a hybrid system is presented. The symbolic representation allows the proposed simulator to calculate the actual solution to the sys...
متن کاملStochastic Satisfiability Modulo Theory: A Novel Technique for the Analysis of Probabilistic Hybrid Systems
The analysis of hybrid systems exhibiting probabilistic behaviour is notoriously difficult. To enable mechanised analysis of such systems, we extend the reasoning power of arithmetic satisfiability-modulo-theory solving (SMT) by a comprehensive treatment of randomized (a.k.a. stochastic) quantification over discrete variables within the mixed Boolean-arithmetic constraint system. This provides ...
متن کاملEvolution of Symbolization: Signposts to a Bridge Between Connectionist and Symbolic Systems
This paper describes recent attempts to understand the evolution of language in humans and argues that useful lessons can be learned from this analysis by designers of hybrid symbolic/connectionist systems.
متن کاملReachability Analysis of Hybrid Systems with Linear Dynamics
We present results on symbolic reachability analysis for hybrid systems with linear autonomous dynamics in each location.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1995